Distributed processing and temporal codes in neuronal networks
نویسندگان
چکیده
منابع مشابه
Distributed processing in cultured neuronal networks.
Thanks to a number of recent technical advances, it will become increasingly popular to study the very basics of distributed information processing using cultured neuronal networks. Most researchers studying population coding are working with intact, living animals. Clearly, cultured neuronal networks lack many features of real brains, but they retain many others. They develop organotypic synap...
متن کاملProcessing Temporal Constraint Networks
This paper describes new algorithms for processing quantitative and qualitative Temporal Constraint Satisfaction Problems (TCSP). In contrast to discrete Constraint Satisfaction Problems (CSP), enforcing path-consistency on quantitative TCSP is exponential, due to the fragmentation problem. Identifying the fragmentation problem allows us to design several e cient polynomial algorithms that are ...
متن کاملHybrid Regenerating Codes for Distributed Storage Systems
Distributed storage systems are mainly justified due to their ability to store data reliably over some unreliable nodes such that the system can have long term durability. Recently, regenerating codes are proposed to make a balance between the repair bandwidth and the storage capacity per node. This is achieved through using the notion of network coding approach. In this paper, a new variation ...
متن کاملAuditory Temporal Processing Abilities in Early Azari-Persian Bilinguals
Introduction: Auditory temporal resolution and auditory temporal ordering are two major components of the auditory temporal processing abilities that contribute to speech perception and language development. Auditory temporal resolution and auditory temporal ordering can be evaluated by gap-in-noise (GIN) and pitch-pattern-sequence (PPS) tests, respectively. In this survey, the effect of biling...
متن کاملProcessing Disjunctions in Temporal Constraint Networks
The framework of Temporal constraint Satisfaction Problems (TCSP) has been proposed for representing and processing temporal knowledge. Deciding consistency of TCSPs is known to be intractable. As demonstrates in this paper, even local consistency algorithms like path-consistency can be exponential due to the fragmentation problem. We present two new polynomial approximation algorithms, Upper-L...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Cognitive Neurodynamics
سال: 2009
ISSN: 1871-4080,1871-4099
DOI: 10.1007/s11571-009-9087-z